Graph‐like spaces approximated by discrete graphs and applications

نویسندگان

چکیده

We define a distance between energy forms on graph-like metric measure space and suitable discrete weighted graph using the concept of quasi-unitary equivalence. apply this result to graphs, manifolds (e.g. small neighbourhood an embedded graph) or pcf self-similar fractals as spaces with associated canonical Laplacians, e.g., Kirchhoff Laplacian resp. (Neumann) manifold (with boundary), express in terms geometric quantities. In particular, we show that there is sequence domains converging fractal such corresponding converge form. As consequence, spectra functions Laplacians converge, latter operator norm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusion Kernels on Graphs and Other Discrete Input Spaces

The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a general method of constructing natural families of kernels over discrete structures, based on the matrix exponentiation idea. In particular, we focus on generating kernels on graphs, for which we propose a special cla...

متن کامل

Approximated Provenance for Complex Applications

Many applications now involve the collection of large amounts of data from multiple users, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand how information was derived, and consequently difficult to asses its credibility, to optimize and debug its derivation, etc. Prove...

متن کامل

A notion of continuity in discrete spaces and applications

We propose a notion of continuous path for locally finite metric spaces, taking inspiration from the recent development of A-theory for locally finite connected graphs. We use this notion of continuity to derive an analogue in Z of the Jordan curve theorem and to extend to a quite large class of locally finite metric spaces (containing all finite metric spaces) an inequality for the l-distortio...

متن کامل

A characterization of graphs which can be approximated in area by smooth graphs

Received April 29, 1999 / final version received July 21, 2000 Published online September 25, 2000 – c Springer-Verlag & EMS 2000 Abstract. For vector valued maps, convergence in W1 1 and of all minors of the Jacobian matrix in L1 is equivalent to convergence weakly in the sense of currents and in area for graphs. We show that maps defined on domains of dimension n 3 can be approximated strongl...

متن کامل

PRINCIPLES AND APPLICATIONS FOR SUPPORTING SIMILARITY QUERIES IN NON-ORDERED-DISCRETE AND CONTINUOUS DATA SPACES By

PRINCIPLES AND APPLICATIONS FOR SUPPORTING SIMILARITY QUERIES IN NON-ORDERED DISCRETE AND CONTINUOUS DATA SPACES

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Nachrichten

سال: 2021

ISSN: ['1522-2616', '0025-584X']

DOI: https://doi.org/10.1002/mana.201900108